Erratum to "Lattice constellation and codes from quadratic number fields" [IEEE Trans. Inform. Theory, vol. 47, No. 4, May. 2001]

نویسنده

  • Murat Guzeltepe
چکیده

We correct a partial mistake for a metric presented in the article ”Lattice constellation and codes from quadratic number fields” [IEEE Trans. Inform. Theory, vol. 47, No. 4, May. 2001]. We show that the metric defined in the article is not true, therefore, this brings about to destroy the encoding and decoding procedures. Also, we define a proper metric for some codes defined in the article and show that there exist some 1−error correcting perfect codes with respect to this new metric. AMS Classification: 94B05, 94B60

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Techniques of bounding the probability of decoding error for block coded modulation structures

-, “Efficient block-based addressing schemes for the nearly optimum shaping of multi-dimensional signal spaces,” submitted to IEEE Trans. Inform. Theory, 1992. R. Laroia, N. Farvardin, and S. Tretter, “On optimal shaping of multidimensional constellations,” submitted to IEEE Trans. Inform. Theory, 1993. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups, 2nd ed. New York: Sp...

متن کامل

Comment on "New Results on Frame-Proof Codes and Traceability Schemes"

In the paper “New Results on Frame-Proof Codes and Traceability Schemes” by Reihaneh Safavi-Naini and Yejing Wang [IEEE Trans. Inform. Theory, vol. 47, no. 7, pp. 3029– 3033, Nov. 2001], there are lower bounds for the maximal number of codewords in binary frame-proof codes and decoders in traceability schemes. There are also existence proofs using a construction of binary frame-proof codes and ...

متن کامل

Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound

Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. 2055 REFERENCES [1] G. F. M. Beenker, " A note on extended quadratic r...

متن کامل

Coding for delay-insensitive communication with partial synchronization

C. E. Shannon, “A mathematical theory of communication,” Bell Syst. Tech. J., vol. 27, pp. 379-423, July 1948. P. A. Franaszek, “Sequence-state coding for digital transmission,” Bell Syst. Tech. J., vol. 47, pp. 143-157, Jan. 1968. G. F. M. Beenker and K. A. Schouhamer Immink, “A generalized method for encoding and decoding run-length-limited binary sequences,” IEEE Trans. Inform. Theory, vol. ...

متن کامل

A coding scheme for single peak-shift correction in (d, k)-constrained channels

I J. P. Adoul and M. Barth, “Nearest neighbor algorithm for spherical codes from the Leech lattice,” IEEE Trans. Inform. Theory, vol. 34, pt. 11, pp. 1188-1202, Sept. 1988. Y. Be’ery and B. Shahar, “VLSI Architectures for soft decoding of the Leech lattice and the Golay codes,” Proc. IEEE Int. Workshop on Microekctronics in Commun, Interlaken, Switzerland, Mar. 1991. Y. Be’ery, B. Shahar, and J...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1411.7816  شماره 

صفحات  -

تاریخ انتشار 2014